Efficient Trapdoor Hash Functions for Digital Signatures
نویسنده
چکیده
By appending some bits to the original signature, a trapdoor hash function converts any signature scheme into secure signature scheme with very efficient online computation. Many of them have been proposed. The paper presents three new trapdoor hash functions with promotion in offline computation, online computation, appended bits, and the size of trapdoor key (but with longer public key). While the appended bits is shortened half (or more), the efficiency of online computation is doubled or more. These features make it suitable for mobile environment and real-time application.
منابع مشابه
Efficient Quantum-Immune Keyless Signatures with Identity
We show how to extend hash-tree based data signatures to server-assisted personal digital signature schemes. The new signature scheme does not use trapdoor functions and is based solely on cryptographic hash functions and is thereby, considering the current state of knowledge, resistant to quantum computational attacks. In the new scheme, we combine hash-tree data signature (timestamping) solut...
متن کاملEfficient multiple-collision trapdoor hash family
In this paper, we suggest a Q2 multiple-collision trapdoor hash family under both integer factoring and discrete logarithm problems, and we present their security proofs. In multiple-collision trapdoor hash family, exposing multiple collisions of similar hash functions will not disclose the private key of trapdoor hash value. In the proposed multiple-collision trapdoor hash family, a pair of se...
متن کاملAn Efficient Elliptic Curve Discrete Logarithm based Trapdoor Hash Scheme without Key Exposure
The trapdoor hash function plays essential role in constructing certain secure digital signature, and signature scheme that composed by trapdoor hash function is widely applied in different fields. However, the key exposure problem of trapdoor hash scheme has brought great distress. In this paper, an efficient trapdoor hash scheme without key exposure based on elliptic curve discrete logarithm ...
متن کاملHow to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most signature schemes are randomised and allow many possible signatures for a single message. In this case, it may be possible to produce a new signature on a previously signed message. Some applications require that this ty...
متن کاملA Framework for Efficient Signatures, Ring Signatures and Identity Based Encryption in the Standard Model
In this work, we present a generic framework for constructing efficient signature schemes, ring signature schemes, and identity based encryption schemes, all in the standard model (without relying on random oracles). We start by abstracting the recent work of Hohenberger and Waters (Crypto 2009), and specifically their “prefix method”. We show a transformation taking a signature scheme with a v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010